Quasi-cyclic low-density parity-check (QC-LDPC) encoder

ABSTRACT

Methods and systems are disclosed herein for generating parity information for using information in a low-density parity check (LDPC) encoder. A quasi-cyclic LDPC generator matrix K can be generated based on the non-invertible parity-check matrix H. Parity information can be generated by the LDPC encoder based at least in part on the user information, the non-invertible parity check matrix H, and the quasi-cyclic LDPC generator matrix K.

CROSS-REFERENCE TO RELATED APPLICATIONS

This claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Application No. 61/095,131, filed Sep. 8, 2008, this application is hereby incorporated by reference herein in its entirety.

This is related to U.S. application Ser. No. 12/277,118, filed Nov. 24, 2008 which claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Application No. 60/991,450, filed Nov. 30, 2007, both of these applications are hereby incorporated by reference herein in their entirety.

BACKGROUND OF THE DISCLOSURE

The disclosed technology relates generally to data encoding, and more particularly to quasi-cyclic low-density parity check (LDPC) encoders.

With the continuing demand for high-reliability transmission of information in digital communication and storage systems, and with the rapid increase in available computational power, various coding and decoding techniques have been investigated and applied to increase the performance of these systems. One such coding technique, low-density parity check (LDPC) coding, was first proposed in the 1960s, but was not used until the late 1990s when researchers began to investigate iterative coding and decoding techniques.

LDPC codes are among the few known error control coding techniques capable of transmitting information at a rate close to the Shannon limit or channel-capacity. Currently, LDPC codes are considered to be the next-generation communication system encoding standard. LDPC codes can be regular or irregular, have a linear or cyclic coding matrix, and can be decoded in a myriad of ways, ranging in complexity and error performance.

SUMMARY OF THE DISCLOSURE

The present disclosure relates to methods and systems for generating parity information for using information in a low-density parity check (LDPC) encoder. A quasi-cyclic LDPC generator matrix K can be generated based on the non-invertible parity-check matrix H. This the quasi-cyclic LDPC generator matrix K is stored in a memory. Then the parity information can be generated by the LDPC encoder based at least in part on the user information, the non-invertible parity check matrix H, and the quasi-cyclic LDPC generator matrix K. In some embodiments, the stored quasi-cyclic LDPC generator matrix K may be valid for an user information that is to be encoded based on the non-invertible parity check matrix H.

In an embodiment, the quasi-cyclic LDPC generator matrix K can be calculated by selecting a quasi-cyclic square matrix M and then by calculating LDPC generator matrix K based on ΦK=M, where the non-invertible parity check matrix H is

$\begin{bmatrix} A & B & T \\ C & D & E \end{bmatrix},{F =}$ (C+ET⁻¹A), and Φ=(D+ET⁻¹B). The quasi-cyclic square matrix M may be selected such that for any user information u, (I+M)Fu=0. The quasi-cyclic square matrix M may be selected such that is has a rank that is less than or equal to a rank of matrix Φ and such that x^(T)M=0 whenever x^(T)Φ=0 for any vector x.

In an embodiment, a parity seed vector w can be computed based on the user information. The parity information is then generated based at least in part on the quasi-cyclic parity seed matrix K and the parity seed vector w. The parity seed vector w can be computed by solving Mw=Fu, where u is the user information.

BRIEF DESCRIPTION OF THE FIGURES

The above and other aspects and advantages of the invention will be apparent upon consideration of the following detailed description, taken in conjunction with the accompanying drawings, in which like reference characters refer to like parts throughout, and in which:

FIG. 1 is a simplified block diagram of an LDPC error-correcting communications or storage system;

FIG. 2 is an LDPC coding equation based on a quasi-cyclic parity check matrix;

FIG. 3 is an illustrative quasi-cyclic matrix composed of a plurality of [5×5] circulants; and

FIG. 4 is a flowchart of an illustrative process for generating parity information in an LDPC encoder.

DETAILED DESCRIPTION OF THE DISCLOSURE

FIG. 1 shows a simplified and illustrative block diagram of digital communications or storage system 100 that can employ the disclosed technology. System 100 may include LDPC encoder 106, modulator 108, demodulator 112, and LDPC decoder 114, and optionally outer encoder 104 and outer decoder 116. In some embodiments, system 100 may be any suitable communications system that is used to transmit user information 102 from a source to a destination. In other embodiments, system 100 may be a suitable storage system which is used to store and read back user information from a storage medium. User information 102, sometimes referred to by the variable u, may be any form of information or useful data that a user desires to transmit or store, and can be in any suitable digital form (e.g., coded data, uncoded data, etc.).

User information 102 may be transmitted or stored using one or more information-bearing signals. The signals may be transmitted or stored in any suitable transmission or storage medium or media, represented in FIG. 1 by channel 110. For example, channel 110 may be a wired or wireless medium through which the information-bearing signal travels, or an optical (e.g., a CD-ROM), magnetic (e.g., a hard disk), or electrical (e.g., FLASH memory or RAM) storage medium that stores the information-bearing signal. Due to random noise that may occur during transmission and storage, as well as the limited transmission or storage capabilities of channel 110, the information-bearing signal may be corrupted or degraded while being transmitted or stored. Thus, the signal received from channel 110 (e.g., by demodulator 112) may be substantially different than the signal that was originally transmitted or stored (e.g., from modulator 108). To reliably transmit or store information in channel 110, an effective transmitter for preparing and transmitting user information 102 may be needed, as well as a corresponding effective receiver for accurately interpreting user information 102 from a received signal.

In FIG. 1, the transmitter in communications or storage system 100 is embodied by outer encoder 104 (if present), LDPC encoder 106, and modulator 108. The receiver (described below) is embodied by demodulator 112, LDPC decoder 114, and outer decoder 116 (if present). Outer encoder 104 and LDPC encoder 106 may encode user information 102 into encoded information, sometimes referred to by the variable, c. In particular, outer encoder 104 may first encode user information 102 using a suitable code, which may be a systematic code. For example, outer encoder 104 may encode user information 102 using a Bose-Chaudhuri-Hocquenghem (BCH) or Reed-Solomon (RS) code of any suitable correction power. LDPC encoder 106 may then encode the resulting codeword into encoded information c. LDPC encoder 106 may operate concurrently or subsequent to outer encoder 104 using a suitable low-density parity check (LDPC) code that is selected from among a plurality of available LDPC codes.

Once LDPC encoder 106 produces the encoded information, modulator 108 may convert the encoded information into an information-bearing signal for transmission or storage in channel 110. Modulator 108 may operate using a modulation scheme with a signal constellation set of any suitable size and dimension. For example, modulator 108 may use a quadrature amplitude modulation (QAM) scheme (e.g., 4QAM, 16QAM, 32QAM, etc.), a pulse amplitude modulation (PAM) scheme (e.g., 2PAM, 4PAM, 8PAM, etc.), a phase shift keying (PSK) scheme (e.g., QPSK, 8PSK, etc.), and/or a orthogonal frequency division multiplexing (OFDM) scheme. The type of modulation scheme used by modulator 108 may be selected and implemented based on the properties of channel 110.

Demodulator 112 may receive an altered version of the information-bearing signal transmitted or stored by modulator 108. Demodulator 112 may then convert the information-bearing signal back into a digital sequence using the same modulation scheme as that of modulator 108. Demodulator 112 therefore produces a hard-bit or soft-bit estimate of the encoded information, c, that is decoded by LDPC decoder 114 and outer decoder 116. LDPC decoder 114 and outer decoder 116 may decode the estimated encoded information using the same LDPC and outer code, respectively, as those used by LDPC encoder 106 and outer encoder 108 to produce decoded information 108. Thus, if the hard-bit or soft-bit estimate is within the correcting capability of the LDPC and outer codes employed by decoders 114 and 116, decoded information 108 may be the same as user information 102.

As described above, communications or storage system 100 may or may not include outer encoder 104 and outer decoder 116. For purposes of clarity, and not by way of limitation, the various embodiments disclosed herein will often be described as if no outer code is used. For example, various embodiments may be described in which an LDPC encoder directly encodes user information (e.g., LDPC encoder 106 directly encoders user information 102). However, it should be understood that any of the disclosed embodiments of an LDPC encoder may instead encode the output of an outer encoder.

FIG. 2 shows illustrative coding equation 200 that is satisfied when LDPC encoder 106 (FIG. 1) generates encoded information, c, based on a QC-LDPC code defined by parity check matrix 201. In particular, LDPC encoder 106 creates the encoded information, c, in the form of codeword vector 205 that satisfies equation 200. Codeword vector 205 is composed of user information sub-vector 206 and parity sub-vector 208. Since user information sub-vector 206 represents user information 102 (FIG. 1) in vector form, LDPC encoder 106 (FIG. 1) generates codeword vector 205 by computing the parity components of parity sub-vector 208. The calculations implemented by LDPC encoder to compute parity components of parity sub-vector 208 are described in greater detail below.

Parity check matrix 201 is an illustrative parity check matrix defining a particular quasi-cyclic LDPC code that may be employed by LDPC encoder 106 (FIG. 1) and LDPC decoder 114 (FIG. 1) of system 100 (FIG. 1). As a quasi-cyclic parity check matrix, parity check matrix 201 is composed of circular submatrices (circulants) of the same size. A circulant submatrix is a square [m×m] binary matrix with the property that, each row is a cyclically shifted version of a previous row.

FIG. 3 shows an illustrative quasi-cyclic matrix 310 composed of a plurality of [5×5] circulants 311 which may be useful in explaining the structure of parity check matrix 201 (FIG. 2). Each circulant 311 may be a zero matrix (e.g., matrix of all zeros), a one matrix (e.g., matrix of all ones), an identity matrix, an identity matrix shifted by some amount, or any other arbitrary circulant. Circulants 320 and 330 are two exemplary circulant submatrices.

A quasi-cyclic matrix may be considered a sparse matrix if the circulants of the matrix have low row/column weight. The amount of storage required for a sparse quasi-cyclic matrix composed of a plurality of circulants may be reduced by representing each circulant in the matrix using a shorthand notation. For example, each circulant may be represented by storing the positions of the one-bits in its first row (or first column). This compressed representation may be used to store quasi-cyclic parity check matrix in a QC-LDPC coding system, such as that illustrated in FIG. 1. In contrast, a dense quasi-cyclic matrix is composed of a plurality of circulants having a high row/column weight. It may not be practical to store a dense quasi-cyclic matrix using the reduced representation used to store a sparse quasi-cyclic matrix. Alternatively, storing a dense quasi-cyclic matrix using the reduced representation may not significantly affect the amount of storage required to store the a dense quasi-cyclic matrix. A dense circulant may be compressed by storing only its first row or column. The other rows or columns in the dense circulant may be obtained by cyclically shifting the stored row or column.

Returning to FIG. 2, parity check matrix 201 may be represented by a data portions A and C (collectively referred to as the H_(u) matrix) and a parity portions B, T, D, and E (collectively referred to as the H_(p) matrix). The H_(u) matrix includes the circulants in parity check matrix 201 that are multiplied by data symbols in data sub-vector 206 in equation 200, while the H_(p) matrix includes the circulants in parity check matrix 201 that are multiplied by parity symbols in parity sub-vector 208. Because parity check matrix 201 is sparse, it may be stored in a reduced format. Parity portion T is a block triangular matrix (i.e., the circulant submatrices of T above the main diagonal are zero). Because parity portion T is a block triangular matrix, T⁻¹ exists and T⁻¹x is easy to solve for any vector x, using back substitution.

Coding equation 200 shown in FIG. 2 may also be written as: Hc=0  (EQ. 1) where H is a parity check matrix and c is a codeword vector. Equivalently, parity check matrix H may be written as the combination of parity portions B, T, D, and E and data portions A and C and encoded information c may be written as parity information p=[p₁; p₂] and user information u. Based on this, equation 1 may be rewritten as:

$\begin{matrix} {{\begin{bmatrix} A & B & T \\ C & D & E \end{bmatrix} \cdot \begin{bmatrix} u \\ p_{1} \\ p_{2} \end{bmatrix}} = \overset{\_}{0}} & \left( {{EQ}.\mspace{14mu} 2} \right) \end{matrix}$ An LDPC encoder generates parity information p₁ and p₂ based on user information u such that equations 1 and 2 are satisfied. Equation 2 may be further rewritten as: Au+Bp ₁ +Tp ₂=0  (EQ. 3a) Cu+Dp ₁ +Ep ₂=0  (EQ. 3b). Equation 3a may be rewritten as: p ₂ =T ⁻¹(Au+Bp ₁)  (EQ. 4). Substituting equation 4 into equation 3b: Cu+Dp ₁ +ET ⁻¹(Au+Bp ₁)=0 (C+ET ⁻¹ A)u+(D+ET ⁻¹ B)p ₁=0  (EQ. 5a). Defining (C+ET⁻¹A) as F and (D+ET⁻¹B) as Φ, equation 5a can be rewritten as: Fu+Φp ₁=0  (EQ. 5b). When parity check matrix H is full rank, matrix Φ is invertible. In this embodiment, parity information p₁ can be calculated from: p ₁=Φ⁻¹ Fu  (EQ. 6). Then parity information p₂ can be calculated from parity information p₁ using equation 4 above.

When parity check matrix H is not full rank and matrix Φ is not invertible, equation 6 cannot be used to calculate parity information p₁. In this case, a quasi-cyclic square LDPC generator matrix K is determined which in turn can be used to calculate parity information p₁ and p₂ from user information u and parity check matrix H. First, a quasi-cyclic square matrix M is selected such that (I+M)Fu=0  (EQ. 7) for any user information u. Then a quasi-cyclic square LDPC generator matrix K is calculated that satisfies the equation: ΦK=M  (EQ. 8).

Parity information p₁ can then be calculated as p ₁ =KFu  (EQ. 9). It can be verified from equations 7 and 9 that this parity p₁ satisfies equation 5b. In some embodiments, quasi-cyclic square matrices M and K are determined in advance and K can be stored in an LDPC encoder memory. Then the LDPC encoder can calculate parity information p₁ and p₂ using equations 9 and 4, respectively, for any user information u based on the stored value of LDPC generator matrix K.

For some parity check matrices H, there may not be quasi-cyclic square matrices M and K that satisfy the conditions of equations 7 and 8 for all values of user information u. For example, in addition to satisfying the condition of equation 7, (I+M)Fu=0, a value for quasi-cyclic square matrix M, may be selected such that: (1) rank(M)<=rank (Φ) and (2) for any vector x such that x^(T)Φ=0, x^(T)M must also equal 0. These two additional conditions may be imposed on quasi-cyclic square matrix M to help ensure the existence of a valid LDPC generator matrix K. It should be noted that all of these conditions may not be sufficient to guarantee the existence of a valid LDPC generator matrix K. Namely, not all quasi-cyclic square matrices M that meet the conditions above have a corresponding valid value for LDPC generator matrix K.

From this point on, only LDPC codes satisfying the condition that the range space of F is equal to the null space of 1^(T)=[1 1 1 1 . . . 1] will be considered. Most LDPC codes with even column weights will satisfy this condition. The benefit of using LDPC codes that satisfy this condition is that in these codewords 1^(T)F=0 and 1^(T)Φ=0. As seem below, this property can simplify the calculation of quasi-cyclic square matrix K.

If the circulant size of parity check matrix H is odd then M can be selected to be:

$M = \begin{bmatrix} I & 0 & 0 & \ldots & 0 & 0 \\ 0 & I & 0 & \ldots & 0 & 0 \\ 0 & 0 & I & \ldots & 0 & 0 \\ \vdots & \; & \; & \ddots & \; & \vdots \\ 0 & 0 & 0 & \ldots & I & 0 \\ W & W & W & \ldots & W & {I + W} \end{bmatrix}$ where W is the all-ones circulant. It can be seen that with this value of M, (I+M)F=0. Moreover, the rank of M is one less than its dimension. Therefore, the conditions of equations 7 and 8 and well as the other two conditions for matrix M are satisfied for this value of M. Accordingly, there exists LDPC generator matrix K such that ΦK=M, which in turn can be used to calculate parity information p₁ and p₂ as described above.

If the circulant size of parity check matrix H is even, then M is full rank. Because Φ is not full rank, there may not be an LDPC generator matrix K such that ΦK=M. In this instance, the condition (I+M)Fu=0 can be ignored and a parity seed vector w can be calculated using process 400 illustrated by the flowchart of FIG. 4. In particular, this illustrative process can be used to generate a parity seed vector w within an LDPC encoder (e.g., LDPC encoder 106 (FIG. 1)) based on user information u, which in turn can be used with LDPC generator matrix K to calculate parity information p within the LDPC encoder.

Process 400 begins at 402. At 404, vector b may be computed as: b=Fu  (EQ. 10). At 405, a quasi-cyclic square matrix M may be selected such that the equation: Mw=b  (EQ. 11), is easy to solve and that there exists quasi-cyclic LDPC generator matrix K such that that ΦK=M. At 406 equation 11 is solved for parity seed vector w. For example, matrix M may be selected as:

$M = \begin{bmatrix} S & 0 & 0 & \ldots & 0 & I \\ I & I & 0 & \ldots & 0 & 0 \\ 0 & I & I & \ldots & 0 & 0 \\ \vdots & \; & \; & \ddots & \; & \vdots \\ 0 & 0 & 0 & \ldots & I & 0 \\ 0 & 0 & 0 & \ldots & I & I \end{bmatrix}$ where I is the identity matrix and S is the permutation matrix obtained by cyclically shifting the identity matrix to the right by one. That is, S has the form:

$S = {\begin{bmatrix} 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 \end{bmatrix}.}$ In order to solve equation 11, the first block row of w denoted w₁ may be solved first. All block rows of w can be summed as, (I+S)w₁=Σb_(i), where b_(i) are the block rows of b. Because this equation is redundant the first entry of w₁ can be arbitrarily set to be zero. Then the next entry of w₁ can be computed recursively. Finally the other block rows of w can be computed recursively. This approach for solving equation 11 is illustrated in greater detail in related U.S. application Ser. No. 12/277,118, which was incorporated by reference above.

At 407, quasi-cyclic square matrix K can be selected or computed such that ΦK=M. K may be calculated block-column by block-column using any suitable technique. For example, for each block-column, a vector k may be found such that Φk=m, where m is the leading column of M for that block. Let r and c be the dependent rows and columns of Φ. Rows r and columns c are then removed from Φ to form Φ′. Rows r are removed from m to form m′. k′=Φ′⁻¹m′ is computed. The entries of column c of k are set to zero. The rest of k is assigned the values of k′. Then k is assigned to the first column of K in the current block. The rest of the current block can be obtained by circulant shifting. The remaining block columns of quasi-cyclic square matrix K can be computed using this technique. Finally, at steps 408 and 409 parity information p₁ and p₂ is calculated from LDPC generator matrix K as: p ₁ =Kw  (EQ. 12) p ₂ =T ⁻¹(Au+Bp ₁)  (EQ. 13).

In summary, the approach used to calculate parity information p₁ and p₂ depends on characteristics of the parity check matrix H. Where parity check matrix H is full-rank (and therefore Φ is invertible), equation 6 may be used to calculate parity information p₁. Where parity check matrix H is not full-rank either equation 9 or the approach described with respect to FIG. 4 may be used to calculate parity information p₁. Equation 9 may be used to calculate parity information p₁ with LDPC generator matrix K that is computed from matrix M. The selection of matrix M depends one or more of the rank, circulant size, and the column weight of parity check matrix H.

The above described embodiments of the present invention are presented for the purposes of illustration and not of limitation. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended. Furthermore, the present invention is not limited to a particular implementation. For example, one or more steps of methods described above may be performed in a different order or concurrently and still achieve desirable results. The invention may be implemented in hardware, such as on an application specific integrated circuit (ASIC) or on a field-programmable gate array (FPGA). The invention may also be implemented in software. 

What is claimed is:
 1. A method of generating parity information for user information in a low-density parity check (LDPC) encoder using a non-invertible parity check matrix H, the method comprising: calculating a quasi-cyclic LDPC generator matrix K based on the non-invertible parity-check matrix H and a quasi-cyclic square matrix M, wherein the quasi-cyclic square matrix M is selected from a plurality of predetermined matrices based on the non-invertible parity-check matrix H, and wherein the quasi-cyclic LDPC generator matrix K is calculated based on ΦK=M, where the non-invertible parity check matrix H is $\begin{bmatrix} A & B & T \\ C & D & E \end{bmatrix},$ F=(C+ET⁻¹A), and Φ=(D+ET⁻¹B), wherein A and C are circulants representing data portions of the non-invertible parity check matrix H, and wherein B, T, D, and E are circulants representing parity portions of the non-invertible parity check matrix H; storing the quasi-cyclic LDPC generator matrix K in a memory; and generating the parity information in the LDPC encoder based at least in part on the user information, the non-invertible parity check matrix H, and the quasi-cyclic LDPC generator matrix K.
 2. The method of claim 1 wherein the stored quasi-cyclic LDPC generator matrix K is valid for any user information to be encoded based on the non-invertible parity check matrix H.
 3. The method of claim 1 wherein the quasi-cyclic square matrix M is selected such that for any user information u, (I+M)Fu=0.
 4. The method of claim 3 wherein the quasi-cyclic square matrix M has a rank that is less than or equal to a rank of matrix Φ and wherein x^(T)M=0 whenever x^(T)Φ=0 for any vector x.
 5. The method of claim 4 wherein a range space of F is equal to a null space of 1^(T)=[1 1 . . . 1].
 6. The method of claim 1 wherein the quasi-cyclic square matrix ${M = \begin{bmatrix} I & 0 & 0 & \ldots & 0 & 0 \\ 0 & I & 0 & \ldots & 0 & 0 \\ 0 & 0 & I & \ldots & 0 & 0 \\ \vdots & \; & \; & \ddots & \; & \vdots \\ 0 & 0 & 0 & \ldots & I & 0 \\ W & W & W & \ldots & W & {I + W} \end{bmatrix}},$ where I is an identity matrix and W is an all-ones circulant.
 7. The method of claim 1, further comprising computing a parity seed vector w based on the user information and where the parity information is generated based at least in part on the quasi-cyclic parity seed matrix K and the parity seed vector w.
 8. The method of claim 7 wherein computing the parity seed vector w comprises solving an equation Mw=Fu, where u is the user information.
 9. The method of claim 8 wherein the quasi-cyclic square matrix ${M = \begin{bmatrix} S & 0 & 0 & \ldots & 0 & I \\ I & I & 0 & \ldots & 0 & 0 \\ 0 & I & I & \ldots & 0 & 0 \\ \vdots & \; & \; & \ddots & \; & \vdots \\ 0 & 0 & 0 & \ldots & I & 0 \\ 0 & 0 & 0 & \ldots & I & I \end{bmatrix}},$ where I is an identity matrix and S is a permutation matrix.
 10. A system for generating parity information for user information using a non-invertible parity check matrix H, the system comprising a low-density parity check (LDPC) encoder operative to: calculate a quasi-cyclic LDPC generator matrix K based on the non-invertible parity-check matrix H and a quasi-cyclic square matrix M, wherein the quasi-cyclic square matrix M is selected from a plurality of predetermined matrices based on the non-invertible parity-check matrix H, and wherein the quasi-cyclic LDPC generator matrix K is calculated based on ΦK=M, where the non-invertible parity check matrix H is $\begin{bmatrix} A & B & T \\ C & D & E \end{bmatrix},$ F=(C+ET⁻¹A), and Φ=(D+ET⁻¹B), wherein A and C are circulants representing data portions of the non-invertible parity check matrix H, and wherein B, T, D, and E are circulants representing parity portions of the non-invertible parity check matrix H; store the quasi-cyclic LDPC generator matrix K in a memory; and generate the parity information in the LDPC encoder based at least in part on the user information, the non-invertible parity check matrix H, and the quasi-cyclic LDPC generator matrix K.
 11. The system of claim 10 wherein the quasi-cyclic LDPC generator matrix K stored in the memory is valid for any user information to be encoded based on the non-invertible parity check matrix H.
 12. The system of claim 10 wherein the quasi-cyclic square matrix M is selected such that for any user information u, (I+M)Fu=0.
 13. The system of claim 12 wherein the quasi-cyclic square matrix M has a rank that is less than or equal to a rank of matrix Φ and wherein x^(T)M=0 whenever x^(T)Φ=0 for any vector x.
 14. The system of claim 13 wherein a range space of F is equal to a null space of 1^(T)=[1 1 . . . 1].
 15. The system of claim 10 wherein the quasi-cyclic square matrix ${M = \begin{bmatrix} I & 0 & 0 & \ldots & 0 & 0 \\ 0 & I & 0 & \ldots & 0 & 0 \\ 0 & 0 & I & \ldots & 0 & 0 \\ \vdots & \; & \; & \ddots & \; & \vdots \\ 0 & 0 & 0 & \ldots & I & 0 \\ W & W & W & \ldots & W & {I + W} \end{bmatrix}},$ where I is an identity matrix and W is an all-ones circulant.
 16. The system of claim 10, wherein the LDPC encoder is further operative to compute a parity seed vector w based on the user information and where the parity information is generated based at least in part on the quasi-cyclic parity seed matrix K and the parity seed vector w.
 17. The system of claim 16 wherein computing the parity seed vector w comprises solving an equation Mw=Fu, where u is the user information.
 18. The system of claim 17 wherein the quasi-cyclic square matrix ${M = \begin{bmatrix} S & 0 & 0 & \ldots & 0 & I \\ I & I & 0 & \ldots & 0 & 0 \\ 0 & I & I & \ldots & 0 & 0 \\ \vdots & \; & \; & \ddots & \; & \vdots \\ 0 & 0 & 0 & \ldots & I & 0 \\ 0 & 0 & 0 & \ldots & I & I \end{bmatrix}},$ where I is an identity matrix and S is a permutation matrix. 